The version-space algorithm is a form of concept learning. Version spaces attempt to create a ruke to identify a single class form posituve and negative examples. It keepts track of the most general and most specific rules that are consistent with all examples seen so far until there is either one rule left (succes) or none (failure!). The latter makes it sensitive to noisy input.
Defined on page 95
Used on pages 92, 95, 107, 176
Also known as version spaces, version-space
Rule lattice